Stochastic dynamic programming with factored representations
نویسندگان
چکیده
منابع مشابه
Stochastic dynamic programming with factored representations
Markov decision processes (MDPs) have proven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, state-based specifications and computations. To alleviate the combinatorial problems associated with such methods, we propose new representational and computational techniques for MDPs that exploit certain types of prob...
متن کاملDynamic Programming for Factored POMDPs
Contingent planning { constructing a plan in which action selection is contingent on imperfect information received during plan execution { can be formalized as the problem of solving a partially observable Markov decision process (POMDP). Traditional dynamic programming algorithms for POMDPs use a at state representation that enumerates all possible states and state transitions. By contrast, A...
متن کاملDynamic Programming for POMDPsusing a Factored State
Contingent planning { constructing a plan in which action selection is contingent on imperfect information received during plan execution { can be formalized as the problem of solving a partially observable Markov decision process (POMDP). Traditional dynamic programming algorithms for POMDPs use a at state representation that enumerates all possible states and state transitions. By contrast, A...
متن کاملPlanning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by sets of discrete variables. Prior work on SDP has considered only the case of factored states and ignored structure in the action space, causing them to scale poorly in terms of the number of action variables. Our main c...
متن کاملGeometric Programming with Stochastic Parameter
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2000
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(00)00033-3